Algebraic and probabilistic methods in Discrete Mathematics
نویسنده
چکیده
Combinatorics is an essential component of many mathematical areas, and its study has exprienced an impressive growth in recent years. This survey contains a discussion of two of the main general techniques that played a crucial role in the development of modern combinatorics; algebraic methods and probabilistic methods. Both techniques are illustrated by examples, where the emphasis is on the basic ideas and the connection to other areas.
منابع مشابه
Analytical and Verified Numerical Results Concerning Interval Continuous-time Algebraic Riccati Equations
This paper focuses on studying the interval continuous-time algebraic Riccati equation A∗X + XA + Q − XGX = 0, both from the theoretical aspects and the computational ones. In theoretical parts, we show that Shary’s results for interval linear systems can only be partially generalized to this interval Riccati matrix equation. We then derive an efficient technique for enclosing the united stable...
متن کاملAlgebraic algorithms in GF(q)
A computer algebra system [9] is mainly a collection of so-called algebraic algorithms which allow to perform symbolic mathematical computations. One of these systems, ALDEWAC2 [I J present a unique feature: ail the algorithms are accessible and fully documented. It is thus an ideal tool to implement, to measure and to compare algorithms. This report describes algebraic algorithms for computing...
متن کاملA modification of probabilistic hesitant fuzzy sets and its application to multiple criteria decision making
Probabilistic hesitant fuzzy set (PHFS) is a fruitful concept that adds to hesitant fuzzy set (HFS) the term of probability which is able to retain more information than the usual HFS. Here, we demonstrate that the existing definitions of PHFS are not still reasonable, and therefore, we first improve the PHFS definition. By endowing the set and algebraic operations with a new re-definition of P...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملNumerical algorithm for discrete barrier option pricing in a Black-Scholes model with stationary process
In this article, we propose a numerical algorithm for computing price of discrete single and double barrier option under the emph{Black-Scholes} model. In virtue of some general transformations, the partial differential equations of option pricing in different monitoring dates are converted into simple diffusion equations. The present method is fast compared to alterna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002